Automatic run-time choice for simulation length in mimesis

Automatic run-time choice for simulation length in mimesis

– This paper presents an algorithm which prevents a simulation user from choosing a simulation length. This choice is always tricky and often leads to CPU-time waste, not to mention user-time waste. Too often, simulation users forget to compute confidence intervals: they only guess a simulation length and ignore the confidence on the simulation results. Those who do compute them generally try s...

Planning Simulation Run Length for Queueing Systems

Simulation of large scale networks can be very time and resource-consuming. It is hard to predict when the amount of data collected from a simulation is enough and the measurement is accurate enough for the parameter of interest. In this paper, we study the planning of simulation run length, and investigate how many cycles of overflow / non-overflow are needed for the packet loss probability to...

Automatic Partitioning of Large Scale Simulation in Grid Computing for Run Time Reduction

Simulating large-scale systems usually entails exhaustive computational powers and lengthy execution times. The goal of this research is to reduce execution time of large-scale simulations without sacrificing their accuracy by partitioning a monolithic model into multiple pieces automatically and executing them in a distributed computing environment. While this partitioning allows us to distrib...

Run-time support for parallel discrete event simulation languages

A one-time signature using run-length encoding

A one-time signature scheme using run-length encoding is presented, that in the random oracle model offers security against chosen-message attacks. For parameters of interest, the proposed scheme enables about 33% faster verification with a comparable signature size than a construction of Merkle and Winternitz. The public key size remains unchanged (1 hash value). The main price for the faster ...